<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Hard
  </div>
  <div>
   <h1 class="question_title">
    479. Largest Palindrome Product
   </h1>
   <p>
    Find the largest palindrome made from the product of two n-digit numbers.
   </p>
   <p>
    Since the result could be very large, you should return the largest palindrome mod 1337.
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Example:
    </b>
   </p>
   <p>
    Input: 2
   </p>
   <p>
    Output: 987
   </p>
   <p>
    Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <b>
     Note:
    </b>
   </p>
   <p>
    The range of n is [1,8].
   </p>
  </div>
  <div>
   <h1 class="question_title">
    479. 最大回文数乘积
   </h1>
   <p>
    你需要找到由两个 n 位数的乘积组成的最大回文数。
   </p>
   <p>
    由于结果会很大，你只需返回最大回文数 mod 1337得到的结果。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <p>
    输入: 2
   </p>
   <p>
    输出: 987
   </p>
   <p>
    解释: 99 x 91 = 9009, 9009 % 1337 = 987
   </p>
   <p>
    <strong>
     说明:
    </strong>
   </p>
   <p>
    n 的取值范围为&nbsp;[1,8]。
   </p>
  </div>
 </body>
</html>